منابع مشابه
Denotational Completeness Revisited
We deene a notion of Kripke logical predicate for models of classical linear logic. A Kripke logical predicate on a type A will be a set of generalised elements of A satisfying certain closure properties. Denotations of proofs of A will be characterised as those global elements of A satisfying all Kripke logical predicates on A.
متن کاملOn Denotational Completeness
The founding idea of linear logic is the duality between A and A⊥, with values in ⊥. This idea is at work in the original denotational semantics of linear logic, coherent spaces, but also in the phase semantics of linear logic, where the bilinear form which induces the duality is nothing but the product in a monoid M, ⊥ being an arbitrary subset B of M. The rather crude phase semantics has the ...
متن کاملOn Denotational Completeness Extended Abstract
The founding idea of linear logic is the duality between A and A ? , with values in ?. This idea is at work in the original denotational semantics of linear logic, coherent spaces, but also in the phase semantics of linear logic, where the A bilinear form B which induces the duality is nothing but the product in a monoid M , ? being an arbitrary subset B of M. The rather crude phase semantics h...
متن کاملKripke completeness revisited
The evolution of completeness proofs for modal logic with respect to the possible world semantics is studied starting from an analysis of Kripke’s original proofs from 1959 and 1963. The critical reviews by Bayart and Kaplan and the emergence of Henkin-style completeness proofs are detailed. It is shown how the use of a labelled sequent system permits a direct and uniform completeness proof for...
متن کاملModularity of Completeness Revisited
One of the key results in the eld of modularity for Term Rewriting Systems is the modularity of completeness for left linear TRSs established by Toyama Klop and Barendregt in TKB The proof however is quite long and involved In this paper a new proof of this basic result is given which is both short and easy employing the powerful technique of pile and delete already used with success in proving...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1999
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80321-4